A Calculus for Schemas in Z

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Calculus for Schemas in Z

The Z notation (Spivey, 1992b) has become a popular tool, both in teaching software specification and in industrial practice. Testimony to this may be seen in the regular Z User Meetings (Bowen et al., 1997), and numerous tools and textbooks. Examples of the latter include those of Woodcock and Davies (1996) and Wordsworth (1993); there are at least 35 in total. Tools and publications are liste...

متن کامل

A refinement calculus for Z

The lack of a method for developing programs from Z specifications is a difficulty that is now widely recognised. As a contribution to solving this problem, we present ZRC, a refinement calculus based on Morgan's work that incorporates the Z notation and follows its style and con­ ventions. Other refinement techniques have been proposed fOr Z; ZRC builds upon some of them, but distiuguishes its...

متن کامل

Towards Mobile Z Schemas

In this paper we show how to extend the Z language with location and mobile operation schemas. The objective is to seek appropriate models for tackling the space and coordination dimensions of mobility in a software engineering perspective. A case study from the literature is presented to illustrate the benefits of our mobility framework.

متن کامل

passivity in waiting for godot and endgame: a psychoanalytic reading

this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...

Investigating Z : the Schema Calculus

In this paper we introduce and investigate an improved kernel logic ZC for the specii-cation language Z. Unlike the standard accounts 8] 4] 1] 3] this logic is consistent and is easily shown to be sound. We show how a complete schema calculus can be derived within this logic and in doing so we reveal a high degree of logical organisation within the language. Finally, our approach eschews all no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2000

ISSN: 0747-7171

DOI: 10.1006/jsco.1999.0347